ar X iv : 0 80 2 . 32 53 v 1 [ cs . I T ] 2 2 Fe b 20 08 On the Capacity and Design of Limited Feedback Multiuser MIMO

نویسنده

  • David J. Love
چکیده

The theory of multiple-input multiple-output (MIMO) technology has been well-developed to increase fading channel capacity over single-input single-output (SISO) systems. This capacity gain can often be leveraged by utilizing channel state information at the transmitter and the receiver. Users make use of this channel state information for transmit signal adaptation. In this correspondence, we derive the capacity region for the MIMO multiple access channel (MIMO MAC) when partial channel state information is available at the transmitters, where we assume a synchronous MIMO multiuser uplink. The partial channel state information feedback has a cardinality constraint and is fed back from the basestation to the users using a limited rate feedback channel. Using this feedback information, we propose a finite codebook design method to maximize sum-rate. In this correspondence, the codebook is a set of transmit signal covariance matrices. We also derive the capacity region and codebook design methods in the case that the covariance matrix is rank-one (i.e., beamforming). This is motivated by the fact that beamforming is optimal in certain conditions. The simulation results show that when the number of feedback bits increases, the capacity also increases. Even with a small number of feedback bits, the performance of the proposed system is close to an optimal solution with the full feedback.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ar X iv : 0 80 2 . 15 86 v 1 [ cs . S E ] 1 2 Fe b 20 08 Program Promises

The framework of promise theory offers an alternative way of understanding programming models, especially in distributed systems. We show that promise theory can express some familiar constructs and resolve some problems in program interface design, using fewer and simpler concepts than the Unified Modelling Language (UML).

متن کامل

ar X iv : 0 80 2 . 25 80 v 1 [ m at h . G T ] 1 9 Fe b 20 08 3 - Dimensional Schlaefli Formula and Its Generalization

Several identities similar to the Schlaefli formula are established for tetrahedra in a space of constant curvature.

متن کامل

ar X iv : 0 80 2 . 38 39 v 1 [ m at h . G R ] 2 6 Fe b 20 08 Quadratic equations over free groups are NP - complete

We prove that the problems of deciding whether a quadratic equation over a free group has a solution is NP-complete

متن کامل

ar X iv : 0 80 2 . 38 43 v 1 [ m at h . N T ] 2 6 Fe b 20 08 COMPUTATIONAL CLASS FIELD THEORY

Class field theory furnishes an intrinsic description of the abelian extensions of a number field that is in many cases not of an immediate algorithmic nature. We outline the algorithms available for the explicit computation of such extensions.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008